The Strong Arnold Property for 4-connected flat graphs
نویسندگان
چکیده
منابع مشابه
The Strong Arnold Property for 4-connected Flat Graphs
We show that if G = (V,E) is a 4-connected flat graph, then any real symmetric V × V matrix M with exactly one negative eigenvalue and satisfying, for any two distinct vertices i and j, Mij < 0 if i and j are adjacent, and Mij = 0 if i and j are nonadjacent, has the Strong Arnold Property: there is no nonzero real symmetric V ×V matrix X with MX = 0 and Xij = 0 whenever i and j are equal or adj...
متن کاملGenerating 4-connected graphs
5 Let C = {C n : n ≥ 5} and let L = {G : G is the line graph of an internally 4-connected cubic graph}. 6 A classical result of Martinov states that every 4-connected graph G can be constructed from graphs in 7 C ∪L by repeatedly splitting vertices. In this paper we prove that, in fact, G can be constructed from C 5 8 or C 6 in the same way, unless G belongs to C ∪L. Moreover, if G is nonplanar...
متن کاملStrong weakly connected domination subdivisible graphs
The weakly connected domination subdivision number sdγw(G) of a connected graph G is the minimum number of edges which must be subdivided (where each edge can be subdivided at most once) in order to increase the weakly connected domination number. The graph is strongγw-subdivisible if for each edge uv ∈ E(G) we have γw(Guv) > γw(G), where Guv is a graph G with subdivided edge uv. The graph is s...
متن کاملOn graphs satisfying a strong adacency property
ON GRAPHS SATISFYING A STRONG ADJACENCY PROPERTY Y. Ananchuen and L. Caccetta School of Mathematics and Statistics Curtin University of Technology GPO Box U1987 Perth 6001 Western Australia. Dedicated to the memory of Alan Rahilly, 1947 1992 Let m and n be nonnegative integers and k be a positive integer. A graph G is said to have property P*(m,n,k) if for any set of m + n distinct vertices of ...
متن کاملThe super-connected property of recursive circulant graphs
In a graph G, a k-container Ck(u, v) is a set of k disjoint paths joining u and v. A k-container Ck(u, v) is k ∗-container if every vertex of G is passed by some path in Ck(u, v). A graph G is k ∗-connected if there exists a k∗-container between any two vertices. An m-regular graph G is super-connected if G is k∗-connected for any k with 1 k m. In this paper, we prove that the recursive circula...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2017
ISSN: 0024-3795
DOI: 10.1016/j.laa.2017.02.002